Finding Cliques of a Graph using Prime Numbers
نویسندگان
چکیده
This paper proposes a new algorithm for solving maximal cliques for simple undirected graphs using the theory of prime numbers. A novel approach using prime numbers is used to find cliques and ends with a discussion of the algorithm.
منابع مشابه
Community Finding: Partitioning Considered Harmful
Considering a clique as a conservative definition of community structure, we examine how partitioning algorithms interact with cliques. We show that on a wide range of empirical networks, from different domains, significant numbers of cliques are split across different partitions by popular algorithms. We examine the largest connected component of the subgraph formed by retaining only edges in ...
متن کاملThe Sum Graph of Non-essential Submodules
Throughout this paper, R will denote a commutative ring with identity and M is a unitary R- module and Z will denote the ring of integers. We introduce the graph Ω(M) of module M with the set of vertices contain all nontrivial non-essential submodules of M. We investigate the interplay between graph-theoretic properties of Ω(M) and algebraic properties of M. Also, we assign the values of natura...
متن کاملSimplicial cliques in claw-free graphs
A graph G is claw-free if no induced subgraph of it is isomorphic to the complete bipartite graph K1,3, and it is prime if |V (G)| ≥ 4 and there is no X ⊆ V (G) with 1 < |X| < |V (G)| such that every vertex of V (G) \X with a neighbour in X is adjacent to every x ∈ X. A simplicial clique in G is a non-empty clique K, such that for every k ∈ K the set of neighbours of k in V (G) \K is a clique. ...
متن کاملCliques Role in Organizational Reputational Influence: A Social Network Analysis
Empirical support for the assumption that cliques are major determinants of reputational influence derives largely from the frequent finding that organizations which claimed that their cliques’ connections are influential had an increased likelihood of becoming influential themselves. It is suggested that the strong and consistent connection in cliques is at least partially responsible for the ...
متن کاملRecognition by prime graph of the almost simple group PGL(2, 25)
Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0601117 شماره
صفحات -
تاریخ انتشار 2006